Coordinated Beamforming with Relaxed Zero Forcing: The Sequential Orthogonal Projection Combining Method and Rate Control

In this paper, coordinated beamforming based on relaxed zero forcing (RZF) for K transmitter-receiver pair multiple-input single-output (MISO) and multiple-input multiple-output (MIMO) interference channels is considered. In the RZF coordinated beamforming, conventional zero-forcing interference leakage constraints are relaxed so that some predetermined interference leakage to undesired receivers is allowed in order to increase the beam design space for larger rates than those of the zero-forcing (ZF) scheme or to make beam design feasible when ZF is impossible. In the MISO case, it is shown that the rate-maximizing beam vector under the RZF framework for a given set of interference leakage levels can be obtained by sequential orthogonal projection combining (SOPC). Based on this, exact and approximate closed-form solutions are provided in two-user and three-user cases, respectively, and an efficient beam design algorithm for RZF coordinated beamforming is provided in general cases. Furthermore, the rate control problem under the RZF framework is considered. A centralized approach and a distributed heuristic approach are proposed to control the position of the designed rate-tuple in the achievable rate region. Finally, the RZF framework is extended to MIMO interference channels by deriving a new lower bound on the rate of each user.Comment: Lemma 1 proof corrected; a new SOPC algorithm invented; K > N case considere

Outage Probability and Outage-Based Robust Beamforming for MIMO Interference Channels with Imperfect Channel State Information

In this paper, the outage probability and outage-based beam design for multiple-input multiple-output (MIMO) interference channels are considered. First, closed-form expressions for the outage probability in MIMO interference channels are derived under the assumption of Gaussian-distributed channel state information (CSI) error, and the asymptotic behavior of the outage probability as a function of several system parameters is examined by using the Chernoff bound. It is shown that the outage probability decreases exponentially with respect to the quality of CSI measured by the inverse of the mean square error of CSI. Second, based on the derived outage probability expressions, an iterative beam design algorithm for maximizing the sum outage rate is proposed. Numerical results show that the proposed beam design algorithm yields better sum outage rate performance than conventional algorithms such as interference alignment developed under the assumption of perfect CSI.Comment: 41 pages, 14 figures. accepted to IEEE Transactions on Wireless Communication

Non-Audit Services And The Persistence And Market Pricing Of Earnings: Evidence From Korea

We examine the effects of the concurrent provision of audit and non-audit services on auditor independence using earnings persistence, which is one of the qualitative properties of earnings, as well as related market responses. Empirical results are as follows. First, the accruals persistence of the group that is concurrently provided audit and non-audit services in many cases is shown to be lower than that of the group that is not concurrently provided audit and non-audit services. Second, the phenomenon of low accruals persistence of the group that is concurrently provided a lot of audit and non-audit services is shown to be overestimated in the market. This study contributes to existing research in three main respects. First, from the viewpoint of earnings persistence, it is verified that rather than whether non-audit services are provided or not, the level of non-audit services acts as an important factor in determining damage to auditor independence by the concurrent provision of audit and non-audit services. Second, in relation to market rationality, whether the market appropriately reflects changes in the persistence of earnings and accruals according to whether non-audit services are provided or not is analyzed. Third, through additional analysis, it is verified that differences in the persistence of earnings and accruals among groups that are concurrently provided audit and non-audit services vary with the audit environment

Whole-genome association studies of alcoholism with loci linked to schizophrenia susceptibility

BACKGROUND: Alcoholism is a complex disease. There have been many reports on significant comorbidity between alcoholism and schizophrenia. For the genetic study of complex diseases, association analysis has been recommended because of its higher power than that of the linkage analysis for detecting genes with modest effects on disease. RESULTS: To identify alcoholism susceptibility loci, we performed genome-wide single-nucleotide polymorphisms (SNP) association tests, which yielded 489 significant SNPs at the 1% significance level. The association tests showed that tsc0593964 (P-value 0.000013) on chromosome 7 was most significantly associated with alcoholism. From 489 SNPs, 74 genes were identified. Among these genes, GABRA1 is a member of the same gene family with GABRA2 that was recently reported as alcoholism susceptibility gene. CONCLUSION: By comparing 74 genes to the published results of various linkage studies of schizophrenia, we identified 13 alcoholism associated genes that were located in the regions reported to be linked to schizophrenia. These 13 identified genes can be important candidate genes to study the genetic mechanism of co-occurrence of both diseases

Sample-Efficient and Safe Deep Reinforcement Learning via Reset Deep Ensemble Agents

Deep reinforcement learning (RL) has achieved remarkable success in solving complex tasks through its integration with deep neural networks (DNNs) as function approximators. However, the reliance on DNNs has introduced a new challenge called primacy bias, whereby these function approximators tend to prioritize early experiences, leading to overfitting. To mitigate this primacy bias, a reset method has been proposed, which performs periodic resets of a portion or the entirety of a deep RL agent while preserving the replay buffer. However, the use of the reset method can result in performance collapses after executing the reset, which can be detrimental from the perspective of safe RL and regret minimization. In this paper, we propose a new reset-based method that leverages deep ensemble learning to address the limitations of the vanilla reset method and enhance sample efficiency. The proposed method is evaluated through various experiments including those in the domain of safe RL. Numerical results show its effectiveness in high sample efficiency and safety considerations.Comment: NeurIPS 2023 camera-read

Quantile Constrained Reinforcement Learning: A Reinforcement Learning Framework Constraining Outage Probability

Constrained reinforcement learning (RL) is an area of RL whose objective is to find an optimal policy that maximizes expected cumulative return while satisfying a given constraint. Most of the previous constrained RL works consider expected cumulative sum cost as the constraint. However, optimization with this constraint cannot guarantee a target probability of outage event that the cumulative sum cost exceeds a given threshold. This paper proposes a framework, named Quantile Constrained RL (QCRL), to constrain the quantile of the distribution of the cumulative sum cost that is a necessary and sufficient condition to satisfy the outage constraint. This is the first work that tackles the issue of applying the policy gradient theorem to the quantile and provides theoretical results for approximating the gradient of the quantile. Based on the derived theoretical results and the technique of the Lagrange multiplier, we construct a constrained RL algorithm named Quantile Constrained Policy Optimization (QCPO). We use distributional RL with the Large Deviation Principle (LDP) to estimate quantiles and tail probability of the cumulative sum cost for the implementation of QCPO. The implemented algorithm satisfies the outage probability constraint after the training period.Comment: NeurIPS 202